منابع مشابه
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for orthogonal graph drawings. We prove lower bounds on the number of bends and, when crossings are not allowed, also lower bounds on the size of the grid. Communicated by D. Wagner: submitted July 1997; revised November 199...
متن کاملLower Bounds for Planar Orthogonal Drawings of Graphs
We study planar orthogonal drawings of graphs and provide lower bounds on the number of bends along the edges. We exhibit graphs on n vertices that require (n) bends in any layout, and show that there exist optimal drawings that require (n) bends and have all of them on a single edge of length (n 2). This work nds applications in VLSI layout, aesthetic graph drawing, and communication by light ...
متن کاملLower bounds and parallel algorithms for planar orthogonal grid drawings
W e consider the problem of constructing a planar orthogonal grid drawing (or more simply, layout) of an n-vertex graph, with the goal of minimizing the number of bends along the edges. W e exhibit graphs that require Q(n) bends in any layout, and show that there exist optimal drawings that require Q ( n ) bends and have all of them on a single edge of length !2(nz). O n the other side of the c...
متن کاملAlgorithms and Bounds for Overloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity and ease of representation. But when it comes to highdegree and massive graphs, even orthogonal drawings have difficulties producing a clean and simple visualization. In this paper we present a technique called Overloaded Orthogonal Drawing that greatly improves the readability by proposing a new vertex placem...
متن کاملLower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
This paper presents the first non-trivial lower bounds for the total number of bends in 3-D orthogonal graph drawings with vertices represented by points. In particular, we prove lower bounds for the number of bends in 3-D orthogonal drawings of complete simple graphs and multigraphs, which are tight in most cases. These result are used as the basis for the construction of infinite classes of c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 1998
ISSN: 1526-1719
DOI: 10.7155/jgaa.00010